Proof of a Conjecture of Bollobás and Eldridge for Graphs of Maximum Degree Three
نویسندگان
چکیده
Let G1 and G2 be graphs on n vertices. If there are edge-disjoint copies of G1 and G2 in Kn, then we say there is a packing of G1 and G2. A conjecture of Bollob as and Eldridge [5] asserts that, if ( (G1) + 1)( (G2) + 1) n+ 1 then there is a packing of G1 and G2. We prove this conjecture when (G1) = 3, for su ciently large n.
منابع مشابه
Packing d-degenerate graphs
We study packings of graphs with given maximal degree. We shall prove that the (hitherto unproved) Bollobás–Eldridge–Catlin conjecture holds in a considerably stronger form if one of the graphs is d-degenerate for d not too large: if d,∆1,∆2 ≥ 1 and n > max{40∆1 ln ∆2, 40d∆2} then a d-degenerate graph of maximal degree ∆1 and a graph of order n and maximal degree ∆2 pack. We use this result to ...
متن کامل-λ coloring of graphs and Conjecture Δ ^ 2
For a given graph G, the square of G, denoted by G2, is a graph with the vertex set V(G) such that two vertices are adjacent if and only if the distance of these vertices in G is at most two. A graph G is called squared if there exists some graph H such that G= H2. A function f:V(G) {0,1,2…, k} is called a coloring of G if for every pair of vertices x,yV(G) with d(x,y)=1 we have |f(x)-f(y)|2 an...
متن کاملOn the oriented perfect path double cover conjecture
An oriented perfect path double cover (OPPDC) of a graph $G$ is a collection of directed paths in the symmetric orientation $G_s$ of $G$ such that each arc of $G_s$ lies in exactly one of the paths and each vertex of $G$ appears just once as a beginning and just once as an end of a path. Maxov{'a} and Ne{v{s}}et{v{r}}il (Discrete Math. 276 (2004) 287-294) conjectured that ...
متن کاملOn a graph packing conjecture by Bollobás, Eldridge and Catlin
Two graphs G1 and G2 of order n pack if there exist injective mappings of their vertex sets into [n], such that the images of the edge sets are disjoint. In 1978, Bollobás and Eldridge, and independently Catlin, conjectured that if (∆(G1)+1)(∆(G2)+1)≤ n+1, then G1 and G2 pack. Towards this conjecture, we show that for ∆(G1),∆(G2)≥ 300, if (∆(G1)+1)(∆(G2)+1)≤0.6n+1, then G1 and G2 pack. This is ...
متن کاملA short proof of the maximum conjecture in CR dimension one
In this paper and by means of the extant results in the Tanaka theory, we present a very short proof in the specific case of CR dimension one for Beloshapka's maximum conjecture. Accordingly, we prove that each totally nondegenerate model of CR dimension one and length >= 3 has rigidity. As a result, we observe that the group of CR automorphisms associated with each of such models contains onl...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Combinatorica
دوره 23 شماره
صفحات -
تاریخ انتشار 2003